Введите слово или словосочетание на любом языке 👆
Язык:
Перевод и анализ слов искусственным интеллектом ChatGPT
На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:
- как употребляется слово
- частота употребления
- используется оно чаще в устной или письменной речи
- варианты перевода слова
- примеры употребления (несколько фраз с переводом)
- этимология
Что (кто) такое regular graph - определение
Найдено результатов: 1171
Regular graph
GRAPH WHERE EACH VERTEX HAS THE SAME NUMBER OF NEIGHBORS
K-regular graph; K‑regular graph; Regular graph of degree k; Regular directed graph; Regular graphs
In graph theory, a regular graph is a graph where each vertex has the same number of neighbors; i.e.
Distance-regular graph
![The degree 7 [[Klein graph]] and associated map embedded in an orientable surface of genus 3. This graph is distance regular with intersection array {7,4,1;1,2,7} and automorphism group PGL(2,7).](https://commons.wikimedia.org/wiki/Special:FilePath/Klein-map.png?width=200 "The degree 7 [[Klein graph]] and associated map embedded in an orientable surface of genus 3. This graph is distance regular with intersection array {7,4,1;1,2,7} and automorphism group PGL(2,7).")
A REGULAR GRAPH SUCH THAT FOR ANY TWO VERTICES V AND W, THE NUMBER OF VERTICES AT DISTANCE J FROM V AND AT DISTANCE K FROM W DEPENDS ONLY UPON J, K
Distance regular graph; Intersection array; Distance-regular graphs; Intersection Array
In the mathematical field of graph theory, a distance-regular graph is a regular graph such that for any two vertices and , the number of vertices at distance from and at distance from depends only upon , , and the distance between and .
Regular map (graph theory)
![[[Branko Grunbaum]] identified a double-covered cube {8/2,3}, with 6 octagonal faces, double wrapped, needing 24 edges, and 16 vertices. It can be seen as regular map {8,3}<sub>2,0</sub> on a hyperbolic plane with 6 colored octagons.<ref>https://web.archive.org/web/20181126084335/https://sites.math.washington.edu/~grunbaum/Your%20polyhedra-my%20polyhedra.pdf</ref>](https://commons.wikimedia.org/wiki/Special:FilePath/Double-cube-regular-map.png?width=200 "[[Branko Grunbaum]] identified a double-covered cube {8/2,3}, with 6 octagonal faces, double wrapped, needing 24 edges, and 16 vertices. It can be seen as regular map {8,3}<sub>2,0</sub> on a hyperbolic plane with 6 colored octagons.<ref>https://web.archive.org/web/20181126084335/https://sites.math.washington.edu/~grunbaum/Your%20polyhedra-my%20polyhedra.pdf</ref>")
SYMMETRIC TESSELLATION OF A CLOSED SURFACE
Regular map (geometry)
In mathematics, a regular map is a symmetric tessellation of a closed surface. More precisely, a regular map is a decomposition of a two-dimensional manifold (such as a sphere, torus, or real projective plane) into topological disks such that every flag (an incident vertex-edge-face triple) can be transformed into any other flag by a symmetry of the decomposition.
Clerics regular
A CATHOLIC PRIEST, DEACON OR BISHOP WHO IS A MEMBER OF A RELIGIOUS INSTITUTE
Clerk regular; Clerk Regular; Regular Clerk; Regular Clerks; Clerks regular; Regular clerics; Clerks Regular; Clerics Regular; Clerics regular
Clerics regular are clerics (mostly priests) who are members of a religious order under a rule of life (regular). Clerics regular differ from canons regular in that they devote themselves more to pastoral care, in place of an obligation to the praying of the Liturgy of the Hours in common, and have fewer observances in their rule of life.
Null graph
GRAPH WITHOUT EDGES (ON ANY NUMBER OF VERTICES)
Empty tree; Empty graph; Null Graph; Null tree; Singleton graph; Edgeless graph; Order-zero graph
In the mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes called an "empty graph").
Regular army
OFFICIAL ARMY OF A STATE OR COUNTRY
Regular troops; Regular Army; Regular military; Regular armies
A regular army is the official army of a state or country (the official armed forces), contrasting with irregular forces, such as volunteer irregular militias, private armies, mercenaries, etc. A regular army usually has the following:
Turán graph
GRAPH
Turan graph; Cocktail party graph; Octahedral Graph; Octahedral graph
The Turán graph, denoted by T(n,r), is a complete multipartite graph; it is formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and then connecting two vertices by an edge if and only if they belong to different subsets. Where q and s are the quotient and remainder of dividing n by r (so n = qr + s), the graph is of the form K_{q+1, q+1, \ldots, q, q}, and the number of edges is
Dense graph
GRAPH IN WHICH THE NUMBER OF EDGES IS CLOSE TO THE MAXIMUM FOR ITS NUMBER OF VERTICES
Sparse graph; Graph density; Density (graph theory)
In mathematics, a dense graph is a graph in which the number of edges is close to the maximal number of edges (where every pair of vertices is connected by one edge). The opposite, a graph with only a few edges, is a sparse graph.
Butterfly graph
PLANAR GRAPH WITH 5 NODES AND 6 EDGES
Bowtie graph; Hourglass graph; Bowtie-free graphs; Bowtie-free graph
In the mathematical field of graph theory, the butterfly graph (also called the bowtie graph and the hourglass graph) is a planar undirected graph with 5 vertices and 6 edges.ISGCI: Information System on Graph Classes and their Inclusions.
